The Frequency of Elliptic Curve Groups over Prime Finite Fields
نویسندگان
چکیده
منابع مشابه
Efficient Side-channel Aware Elliptic Curve Cryptosystems over Prime Fields
Elliptic Curve Cryptosystems (ECCs) are utilized as an alternative to traditional publickey cryptosystems, and are more suitable for resource limited environments due to smaller parameter size. In this dissertation we carry out a thorough investigation of side-channel attack aware ECC implementations over finite fields of prime characteristic including the recently introduced Edwards formulatio...
متن کاملStructure of finite wavelet frames over prime fields
This article presents a systematic study for structure of finite wavelet frames over prime fields. Let $p$ be a positive prime integer and $mathbb{W}_p$ be the finite wavelet group over the prime field $mathbb{Z}_p$. We study theoretical frame aspects of finite wavelet systems generated by subgroups of the finite wavelet group $mathbb{W}_p$.
متن کاملFast and Flexible Hardware Support for Elliptic Curve Cryptography over Multiple Standard Prime Finite Fields
Supervisory Committee Dr. Daler N. Rakhmatov, Department of Electrical and Computer Engineering Supervisor Dr. T. Aaron Gulliver, Department of Electrical and Computer Engineering Departmental Member Dr. Stephen Neville, Department of Electrical and Computer Engineering Departmental Member Dr. Kui Wu, Department of Computer Science Outside Member Exchange of private information over a public me...
متن کاملEncryption of Data using Elliptic Curve over Finite fields
Cryptography is the study of techniques for ensuring the secrecy and authentication of the information. Public –key encryption schemes are secure only if the authenticity of the public-key is assured. Elliptic curve arithmetic can be used to develop a variety of elliptic curve cryptographic (ECC) schemes including key exchange, encryption and digital signature. The principal attraction of ellip...
متن کاملMulti-sources Randomness Extraction over Finite Fields and Elliptic Curve
This work is based on the proposal of a deterministic randomness extractor of a random Diffie-Hellman element defined over two prime order multiplicative subgroups of a finite fields Fpn , G1 and G2. We show that the least significant bits of a random element in G1 ∗G2, are indistinguishable from a uniform bit-string of the same length. One of the main application of this extractor is to replac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Canadian Journal of Mathematics
سال: 2016
ISSN: 0008-414X,1496-4279
DOI: 10.4153/cjm-2015-013-1